Risk, Delay, and Convex Self-Control Costs

Risk, Delay, and Convex Self-Control Costs

The dual-self model supposes that decision-making involves a conflict between the desire for immediate and safe gratification on the one hand, and riskier long term benefits on the other. This conflict is resolved through a decision criterion that puts weights on both desires. A key element of the model is that this weighting is endogenous, and that changes in constraints that have the same eff...

Dynamic Scheduling with Convex Delay Costs: The Generalized c Rule

We consider a general single-server multiclass queueing system that incurs a delay cost Ck( k) for each class k job that resides k units of time in the system. This paper derives a scheduling policy that minimizes the total cumulative delay cost when the system operates during a nite time horizon. Denote the marginal delay cost and (instantaneous) service rate functions of class k by ck = C 0 k...

network optimization with piecewise linear convex costs

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

Knowing the Costs and Delay

functions of fundamental building blocks enables designers to optimize costs and propagation delays of the larger units built from them. A fundamental building block of an arithmetic logic unit (ALU) is the binary adder. In this article, we examine the implementation of fixed-point adders on Xilinx 4000 series FPGA chips and cost and delay functions of various addition algorithms. On the basis ...

Delay, Disruption and Acceleration Costs